Can spreadsheet solvers solve demanding optimization problems?
نویسندگان
چکیده
Practicing engineers resort to modular simulators or to algebraic tools such as GAMS or AMPL for performing complex process optimizations. These tools, however, have a signi®cant learning curve unless they have been introduced at the undergraduate level beforehand. In this work we show how the Solver feature of the Excel spreadsheet can be used for the optimization of a fairly complex system, i.e., a classic solvent extraction/pollution prevention with heat integration process. The speci®c goal was the design optimization for continuous recovery of organic solvents (VOCs) using a gas absorption tower with solvent recovery in a stripper. It is shown that the Solver feature of the Excel spreadsheet can be used to converge on local optima for these complex systems, provided proper care is taken in the solution procedure. The complexities of optimization can also be demonstrated with this tool, as can several common pitfalls encountered during optimization. ß2001 John Wiley & Sons, Inc. Comput Appl Eng Educ 9: 49±56, 2001
منابع مشابه
A decision support methodology for stochastic multi-criteria linear programming using spreadsheets
In recent years, tools for solving optimization problems have become widely available through the integration of optimization software (or solvers) with all major spreadsheet packages. These solvers are highly effective on traditional linear programming (LP) problems with known, deterministic parameters. However, thoughtful analysts may rightly question the quality and robustness of optimal sol...
متن کاملIntelligent Mathematical Programming Software: Past, Present, and Future
The practice of mathematical programming has been profoundly affected in recent years by two key trends: the proliferation of powerful and inexpensive computing platforms, and greatly improved solution algorithms. These trends allow experienced mathematical programmers to solve models of much greater scale and complexity than previously possible. But at the same time, these trends have introduc...
متن کاملAugmented Lagrangian Algorithms under Constraint Partitioning
We present a novel constraint-partitioning approach for solving continuous nonlinear optimization based on augmented Lagrange method. In contrast to previous work, our approach is based on a new constraint partitioning theory and can handle global constraints. We employ a hyper-graph partitioning method to recognize the problem structure. We prove global convergence under assumptions that are m...
متن کاملPB-smodels a Pseudo-Boolean Solver
A pseudo-boolean constraint (PB-constraint) is a linear inequality with 0-1 variables and integer coefficients. Search problems can be modeled as sets of PB-constraints, so that, solutions to a set of PB-constraints map to solutions of the search problem. An optimization problem can be modeled using a set of PB-constraints along with an optimization statement over a set of 0-1 variables. Pseudo...
متن کاملA Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors
The standard method for deciding bit-vector constraints is via eager reduction to propositional logic. This is usually done after first applying powerful rewrite techniques. While often efficient in practice, this method does not scale on problems for which top-level rewrites cannot reduce the problem size sufficiently. A lazy solver can target such problems by doing many satisfiability checks,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Applic. in Engineering Education
دوره 9 شماره
صفحات -
تاریخ انتشار 2001